Elliptic-curve scalar multiplication algorithm using ZOT structure

نویسندگان

  • Hani Almimi
  • Azman Samsudin
  • Shahram Jahani
چکیده

The computation of P over elliptic curves is the dominant operation. It depends on the representation of the scalar . The binary method is the standard unsigned method that is used to compute the elliptic curve point . Researchers found that it is not the most efficient way for implementing elliptic curve computations. Other recoding methods such as CR, NAF, and MOF were presented in order to enhance the efficiency of EC computations. Our ZOTEC method that is based on ZOT recoding method was proposed to accelerate the EC computations. ZOTEC can be computed rightto-left or left-to-right. The recoding process is also faster than NAF and as fast as CR and MOF if the binary conversion included or excluded. ZOTEC method is more efficient than BIN, CR, MOF, and NAF methods in terms of field complexity and time complexity whenever a field inversion is more expensive than 6 multiplications for BIN, CR, and MOF, and 8.3 for NAF.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Elliptic Curve Scalar Point Multiplication Algorithm Using Radix-4 Booth’s Algorithm

The main back-bone operation in elliptic curve cryptosystems is scalar point multiplication. The most frequently used method implementing the scalar point multiplication, which is performed in the topmost level of GF multiplication and GF division, has been the double-and-add algorithm, which is being recently challenged by NAF (Non-Adjacent Format) algorithm. In this paper, we propose a more e...

متن کامل

An Efficient Scalar Multiplication Algorithm for Elliptic Curve Cryptography Using a New Signed-Digit Representation

This paper presents and evaluates a novel encoding algorithm to reduce the Hamming weight of the scalar. The scalar multiplication is modified to utilize this new scalar representation. The results show that the computation cost (the number of required clock cycles) in the proposed scalar multiplication is effectively reduced in comparison with other modified binary scalar multiplication algori...

متن کامل

A Novel Method for Elliptic Curve Multi-Scalar Multiplication

The major building block of most elliptic curve cryptosystems are computation of multi-scalar multiplication. This paper proposes a novel algorithm for simultaneous multi-scalar multiplication, that is by employing addition chains. The previously known methods utilizes double-and-add algorithm with binary representations. In order to accomplish our purpose, an efficient empirical method for fin...

متن کامل

Novel Method for Elliptic Curve Multi-Scalar Multiplication

The major building block of most elliptic curve cryptosystems are computation of multi-scalar multiplication. This paper proposes a novel algorithm for simultaneous multi-scalar multiplication, that is by employing addition chains. The previously known methods utilizes double-and-add algorithm with binary representations. In order to accomplish our purpose, an efficient empirical method for fin...

متن کامل

A Binary Redundant Scalar Point Multiplication in Secure Elliptic Curve Cryptosystems

The main back-bone operation in elliptic curve cryptosystems is scalar point multiplication. The most frequently used method implementing the scalar point multiplication which is performed in the top level of GF (Galois Field) multiplication and GF division, has been the double-andadd algorithm, which is being recently challenged by NAF (Non-Adjacent Format) algorithm. In this paper, we propose...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Security and Communication Networks

دوره 8  شماره 

صفحات  -

تاریخ انتشار 2015